Fuzzy constraint handling technique used with genetic algorithms to optimize order quantity
نویسندگان
چکیده
منابع مشابه
A Survey of Constraint Handling Techniques used with Evolutionary Algorithms
Despite the extended applicability of evolutionary algorithms to a wide range of domains, the fact that these algorithms are unconstrained optimization techniques leaves open the issue regarding how to incorporate constraints of any kind (linear, non-linear, equality and inequality) into the tness function as to search eeciently. The main goal of this paper is to provide a detailed and comprehe...
متن کاملA Constraint-Handling Technique for Genetic Algorithms using a Violation Factor
Corresponding Author: Adam Chehouri Anti Icing Materials International Laboratory (AMIL), Université du Québec à Chicoutimi, 555 Boulevard de l’Université, Canada G7H 2B1, Canada Tel: +1 (418) 290-0705 Fax: +1 (418) 696-2908 Email: [email protected] Abstract: Over the years, several meta-heuristic algorithms were proposed and are now emerging as common methods for constrained optimization ...
متن کاملn Solving Fuzzy Constraint Satisfaction Problems with Genetic Algorithms
An attempt to solve fuzzy constraint satisfaction problems (FCSPs) with the use of genetic algorithms (GAS) is presented in the paper. A fuzzy relation that represents the degrees of Satisfaction of fuzzy constraints in a given FCSP is considered as an objective jimction of the respective unconstrained optimization problem. A solution of a FCSP such that all constraints are satisfied to the max...
متن کاملAn ecient constraint handling method for genetic algorithms
Many real-world search and optimization problems involve inequality and/or equality constraints and are thus posed as constrained optimization problems. In trying to solve constrained optimization problems using genetic algorithms (GAs) or classical optimization methods, penalty function methods have been the most popular approach, because of their simplicity and ease of implementation. However...
متن کاملConstraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by many airlines as a mathematical model for flight crew scheduling. A key feature of the SPP is that it is a highly constrained problem, all constraints being equalities. New genetic algorithm (GA) components: separate fitn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Eastern-European Journal of Enterprise Technologies
سال: 2014
ISSN: 1729-4061,1729-3774
DOI: 10.15587/1729-4061.2014.27915